Temporalizing rewritable query languages over knowledge bases

Ontology-based data access (OBDA) generalizes query answering in relational databases. It allows to query a databaseby using the language of an ontology, abstracting from the actual relations of the database. OBDA can sometimes berealized by compiling the information of the ontology into the query and the database. The resulting query is thenanswered using classical database techniques.In this paper, we consider a temporal version of OBDA. We propose a generic temporal query language that combineslinear temporal logic with queries over ontologies. This language is well-suited for expressing temporal properties ofdynamic systems and is useful in context-aware applications that need to detect specific situations. We show that, ifatemporal queries are rewritable in the sense described above, then the corresponding temporal queries are also rewritablesuch that we can answer them over a temporal database. We present three approaches to answering the resulting queries.